John Peabody Harrington, 1884-1961

Ichiro Fujinaga Peabody

The realtime manipulation of audio with desktop computers has become both possible and popular over the last several years. Perhaps the most important aspect that determines the suitability of a computer operating system for this application is the latency of its audio system. This paper describes the results of an experiment measuring the audio latency of several current desktop operating syst...

Francis W. Peabody, 1917

A tribute to John Capehart, MD, "Sooner proud" and 1961 National Spelling Bee champion.

M embers of the Department of Th oracic and Cardiovascular Surgery, including allied health professionals and staff from transplant services, the anesthesia department, and the operating room, along with everyone at Baylor University Medical Center at Dallas, wish to honor John Capehart, MD, by congratulating him on the 50th anniversary of winning the National Spelling Bee. John was the fi rst ...

The Paris-Harrington Theorem

In Ramsey theory, very large numbers and fast-growing functions are more of a rule than an exception. The classical Ramsey numbers R(n,m) are known to be of exponential size: the original proof directly gives the upper bound R(n,m) ≤ ( m+n−2 n−1 ) , and an exponential lower bound is also known. For the van der Waerden numbers, the original proof produced upper bounds that were not even primitiv...

2 Leo Harrington And

1. Introduction A set A of nonnegative integers is computably enumerable (c.e.), also called recursively enumerable (r.e.), if there is a computable method to list its elements.